A Complete Natural Deduction System for the Relational Calculus
نویسنده
چکیده
A relational calculus is a formal system in which relation is the fundamental concept. The simplest relational calculus, that of ordinary binary relations, was introduced by Tarski in [4]. Tarski’s system is essentially an algebra in which the operations are the usual Boolean operations (on sets of ordered pairs) together with the two special operations converse (denoted byq) and composition (denoted by “;” or by juxtaposition). For any binary relations P and Q
منابع مشابه
A Logic of Type Relations and its Applications to Relational Databases
A calculus of typed relations subsuming the classical relational database theory is presented. An associated sound and complete deduction mechanism is developed. The formulation is generalized to deal with nondeterministic databases and information relations in the rough set-style. keywords: relational logic, typed relations, relational database, nondeterministic databases, information relation...
متن کاملExtending the Qualitative Trajectory Calculus Based on the Concept of Accessibility of Moving Objects in the Paths
Qualitative spatial representation and reasoning are among the important capabilities in intelligent geospatial information system development. Although a large contribution to the study of moving objects has been attributed to the quantitative use and analysis of data, such calculations are ineffective when there is little inaccurate data on position and geometry or when explicitly explaining ...
متن کاملLogical Analysis of Demonic Nondeterministic Programs
A logical framework is presented for representing and reasoning about nondeterministic programs that may not terminate. We propose a logic PDL(; ;, ||, d(∗)) which is an extension of dynamic logic such that the program constructors related to demonic operations are introduced in its language. A complete and sound Hilbert-style proof system is given and it is shown that PDL(; ;, ||, d(∗)) is dec...
متن کاملAn Isomorphism between a Fragment of Sequent Calculus and an Extension of Natural Deduction
Variants of Herbelin’s λ-calculus, here collectively named Herbelin calculi, have proved useful both in foundational studies and as internal languages for the efficient representation of λ-terms. An obvious requirement of both these two kinds of applications is a clear understanding of the relationship between cut-elimination in Herbelin calculi and normalisation in the λ-calculus. However, thi...
متن کاملCompleting Herbelin's Programme
In 1994 Herbelin started and partially achieved the programme of showing that, for intuitionistic implicational logic, there is a Curry-Howard interpretation of sequent calculus into a variant of the λ-calculus, specifically a variant which manipulates formally “applicative contexts” and inverts the associativity of “applicative terms”. Herbelin worked with a fragment of sequent calculus with c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012